Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
Qu'est-ce (qui) est recursive descent - définition
Recursive descent parser
ALGORITHM
Recursive descent; Recursive-descent parsers; Recursive descent parsers; Recursive-descent parser; Predictive parser; Recursive descent parsing; Predictive parsing; Recursive parser
In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure implements one of the nonterminals of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes.
recursive descent parser
ALGORITHM
Recursive descent; Recursive-descent parsers; Recursive descent parsers; Recursive-descent parser; Predictive parser; Recursive descent parsing; Predictive parsing; Recursive parser
<grammar> A "top-down" parser built from a set of
mutually-recursive procedures or a non-recursive equivalent
where each such procedure usually implements one of the
productions of the grammar. Thus the structure of the
resulting program closely mirrors that of the grammar it
recognises.
["Recursive Programming Techniques", W.H. Burge, 1975, ISBN
0-201-14450-6 ].
(1995-04-28)
General recursive function
ONE OF SEVERAL EQUIVALENT DEFINITIONS OF A COMPUTABLE FUNCTION
Partial recursive function; Total recursive function; Mu-recursive; Mu recursive function; Mu-recursive function; Recursive function theory; M-recursive function; Μ recursion; General-recursive; General recursive; Recursive function (computability); Μ-recursive function; Μ-recursive
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function).
